Matrix-Vector Based Fast Fourier Transformations on SDR Architectures

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Matrix Multiplication Algorithms on Mimd Architectures

Sequential fast matrix multiplication algorithms of Strassen and Winograd are studied; the complexity bound given by Strassen is improved. These algorithms are parallelized on MIMD distributed memory architectures of ring and torus topologies; a generalization to a hyper-torus is also given. Complexity and efficiency are analyzed and good asymptotic behaviour is proved. These new parallel algor...

متن کامل

Matrix and Vector Sequence Transformations Revisitedc

Sequence transformations are extrapolation methods. They are used for the purpose of convergence acceleration. In the scalar case, such algorithms can be obtained by two diierent approaches which are equivalent. The rst one is an elimination approach based on the solution of a system of linear equations and it makes use of determinants. The second approach is based on the notion of annihilation...

متن کامل

Computing the Fast Fourier Transform on a Vector Computer

Two algorithms are presented for performing a Fast Fourier Transform on a vector computer and are compared on the Control Data Corporation STAR-100. The relative merits of the two algorithms are shown to depend upon whether only a few or many independent transforms are desired. A theorem is proved which shows that a set of independent transforms can be computed by performing a partial transform...

متن کامل

On Matrix Transformations concerning the Nakano Vector-valued Sequence Space

We give the matrix characterizations from Nakano vector-valued sequence space (X,p) and Fr (X,p) into the sequence spaces Er , ∞, ∞(q), bs, and cs, where p = (pk) and q = (qk) are bounded sequences of positive real numbers such that pk > 1 for all k∈N and r ≥ 0. 2000 Mathematics Subject Classification. 46A45.

متن کامل

Fast QMC Matrix-Vector Multiplication

Quasi-Monte Carlo (QMC) rules 1/N ∑N−1 n=0 f(ynA) can be used to approximate integrals of the form ∫ [0,1]s f(yA) dy, where A is a matrix and y is row vector. This type of integral arises for example from the simulation of a normal distribution with a general covariance matrix, from the approximation of the expectation value of solutions of PDEs with random coefficients, or from applications fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Radio Science

سال: 2008

ISSN: 1684-9973

DOI: 10.5194/ars-6-89-2008